The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem
نویسندگان
چکیده
منابع مشابه
Directed Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long time open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixed-parameter tractable and give the first FPT algorithm of running time O((1.48k)n) for it. As the feedback arc set problem in directed graph can be transformed to a feedb...
متن کاملFeedback Arc Set Problem in Bipartite Tournaments
In this paper we give ratio 4 deterministic and randomized approximation algorithms for the FEEDBACK ARC SET problem in bipartite tournaments. We also generalize these results to give a factor 4 deterministic approximation algorithm for FEEDBACK ARC SET problem in multipartite tournaments. © 2007 Elsevier B.V. All rights reserved.
متن کاملAn Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph
The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomial-time algorithm...
متن کاملA heuristic for the feedback arc set problem
Since the FAS problem is NP-hard it that we can this problem in time. A number of heuristics have been published. Some achieve the solutions for classes of (such as "reducible flow and "planar [R88]), while the others are measured by performance bounds. The most recent two heuristics for solving the FAS may be found in [BS90, The heuristic provided in feedback arc set whose at most m -8 m 5m 2 ...
متن کاملA Fast Effective Heuristic for the Feedback Arc Set Problem
Let G V A denote a simple connected directed graph and let n jV j m jAj where n m n A feedback arc set FAS of G denoted R G is a possibly empty set of arcs whose reversal makes G acyclic A minimum feedback arc set of G denoted R G is a FAS of minimum cardinality r G the computa tion of R G is called the FAS problem For every n let n denote the maximum over all digraphs G of order n of jR G j Be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9811-2